Nonlinear Steepest Descent and Numerical Solution of Riemann-Hilbert Problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonlinear steepest descent and the numerical solution of Riemann–Hilbert problems

The effective and efficient numerical solution of Riemann–Hilbert problems has been demonstrated in recent work. With the aid of ideas from the method of nonlinear steepest descent for Riemann– Hilbert problems, the resulting numerical methods have been shown numerically to retain accuracy as values of certain parameters become arbitrarily large. The primary aim of this paper is to prove that t...

متن کامل

A Steepest Descent Method for Oscillatory Riemann-hilbert Problems

but it will be clear immediately to the reader with some experience in the field, that the method extends naturally and easily to the general class of wave equations solvable by the inverse scattering method, such as the KdV, nonlinear Schrödinger (NLS), and Boussinesq equations, etc., and also to "integrable" ordinary differential equations such as the Painlevé transcendents. As described, for...

متن کامل

Numerical Solution of Riemann-Hilbert Problems: Painlevé II

We describe a new, spectrally accurate method for solving matrixvalued Riemann–Hilbert problems numerically. The effectiveness of this approach is demonstrated by computing solutions to the homogeneous Painlevé II equation. This can be used to relate initial conditions with asymptotic behaviour.

متن کامل

Steepest descent method for solving zero-one nonlinear programming problems

In this paper we use steepest descent method for solving zero-one nonlinear programming problem. Using penalty function we transform this problem to an unconstrained optimization problem and then by steepest descent method we obtain the original problem optimal solution. 2007 Elsevier Inc. All rights reserved.

متن کامل

The global parametrix in the Riemann-Hilbert steepest descent analysis for orthogonal polynomials

In the application of the Deift-Zhou steepest descent method to the Riemann-Hilbert problem for orthogonal polynomials, a model Riemann-Hilbert problem that appears in the multi-cut case is solved with the use of hyperelliptic theta functions. We present here an alternative approach which uses meromorphic differentials instead of theta functions to construct the solution of the model Riemann-Hi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications on Pure and Applied Mathematics

سال: 2013

ISSN: 0010-3640

DOI: 10.1002/cpa.21497